The Combinatorial Nullstellensätze Revisited

نویسنده

  • Pete L. Clark
چکیده

We revisit and further explore the celebrated Combinatorial Nullstellensätze of N. Alon in several different directions. Terminology: Throughout this note, a “ring” is a commutative ring with multiplicative identity. A “domain” is a ring R such that for all a, b ∈ R \ {0}, ab ̸= 0. A ring R is “reduced” if for all x ∈ R and n ∈ Z, if x = 0 then x = 0.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof of the List Edge Coloring Conjecture for Complete Graphs of Prime Degree

We prove that the list-chromatic index and paintability index of Kp+1 is p, for all odd primes p. This implies that the List Edge Coloring Conjecture holds for complete graphs with less than 10 vertices. It also shows that there exist arbitrarily big complete graphs for which the conjecture holds, even among the complete graphs of class 1. Our proof combines the Quantitative Combinatorial Nulls...

متن کامل

Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals

We revisit a well-known family of polynomial ideals encoding the problem of graph-kcolorability. Our paper describes how the inherent combinatorial structure of the ideals implies several interesting algebraic properties. Specifically, we provide lower bounds on the difficulty of computing Gröbner bases and Nullstellensatz certificates for the coloring ideals of general graphs. For chordal grap...

متن کامل

Dynamical method in algebra: effective Nullstellensätze

We give a general method for producing various effective Null and Positivstellensätze, and getting new Positivstellensätze in algebraically closed valued fields and ordered groups. These various effective Nullstellensätze produce algebraic identities certifying that some geometric conditions cannot be simultaneously satisfied. We produce also constructive versions of abstract classical results ...

متن کامل

Alternating paths revisited IV: packings and 2-packings of A-paths

We construct a combinatorial algorithm to find a maximum packing of fully node-disjoint A-paths. In doing this, we discover relations with fractional packings, 2-packings, and b-packings.

متن کامل

Punctured combinatorial Nullstellensätze

In this article we extend Alon’s Nullstellensatz to functions which have multiple zeros at the common zeros of some polynomials g1, g2, . . . , gn, that are the product of linear factors. We then prove a punctured version which states, for simple zeros, that if f vanishes at nearly all, but not all, of the common zeros of g1(X1), . . . , gn(Xn) then every residue of f modulo the ideal generated...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2014